Biased random walks and propagation failure.

نویسندگان

  • Vicenç Méndez
  • Sergei Fedotov
  • Daniel Campos
  • Werner Horsthemke
چکیده

The critical value of the reaction rate able to sustain the propagation of an invasive front is obtained for general non-Markovian biased random walks with reactions. From the Hamilton-Jacobi equation corresponding to the mean field equation we find that the critical reaction rate depends only on the mean waiting time and on the statistical properties of the jump length probability distribution function and is always underestimated by the diffusion approximation. If the reaction rate is larger than the jump frequency, invasion always succeeds, even in the case of maximal bias. Numerical simulations support our analytical predictions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Localization transition of biased random walks on random networks.

We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength bc exists such that most walks find the target within a finite time when b > bc. For b < bc, a finite fraction of walks drift off to infinity before hitting the target. The phase transition at b=bc is a critical point in the sense that quantities su...

متن کامل

Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs

A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to a legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers a legitimate computation, but only probabilistically, unlike a self-stabilizing system,...

متن کامل

Non-Backtracking Centrality Based Random Walk on Networks

Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...

متن کامل

Biased random walks on multiplex networks

Biased random walks on complex networks are a particular type of walks whose motion is biased on properties of the destination node, such as its degree. In recent years they have been exploited to design efficient strategies to explore a network, for instance by constructing maximally mixing trajectories or by sampling homogeneously the nodes. In multiplex networks, the nodes are related throug...

متن کامل

Topologically biased random walk and community finding in networks.

We present an approach of topology biased random walks for undirected networks. We focus on a one-parameter family of biases, and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of biased random walks. This analogy is extended through the use of parametric equations of motion to study the features of random walks vs parameter values. Furthermo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 75 1 Pt 1  شماره 

صفحات  -

تاریخ انتشار 2007